Expurgated Bounds for the Asymmetric Broadcast Channel

Expurgated Bounds for the Asymmetric Broadcast Channel

This work contains two main contributions concerning the expurgation of hierarchical ensembles for the asymmetric broadcast channel. The first is an analysis of the optimal maximum likelihood (ML) decoders for the weak and strong user. Two different methods of code expurgation will be used, that will provide two competing error exponents. The second is the derivation of expurgated exponents und...

A note on outer bounds for broadcast channel

In this note we establish two facts concerning the so-called New-Jersey outer bound. We show that this outer bound is equivalent to a much simpler computable region; and secondly we show that in the absence of private information this bound is exactly same as the UV -outerbound.

Combinatorial Bounds for Broadcast Encryption

A broadcast encryption system allows a center to communicate securely over a broadcast channel with selected sets of users. Each time the set of privileged users changes, the center enacts a protocol to establish a new broadcast key that only the privileged users can obtain, and subsequent transmissions by the center are encrypted using the new broadcast key. We study the inherent trade-off bet...

Exact Random Coding Exponents and Universal Decoders for the Asymmetric Broadcast Channel

This work contains two main contributions concerning the asymmetric broadcast channel. The first is an analysis of the exact random coding error exponents for both users, and the second is the derivation of universal decoders for both users. These universal decoders are certain variants of the maximum mutual information (MMI) universal decoder, which achieve the corresponding random coding expo...

Bounds on the performance of protocols for a multiple-access broadcast channel